Most Laplacian eigenvalues of a tree are small

Small Eigenvalues of the Conformal Laplacian

We introduce a differential topological invariant for compact differentiable manifolds by counting the small eigenvalues of the Conformal Laplace operator. This invariant vanishes if and only if the manifold has a metric of positive scalar curvature. We show that the invariant does not increase under surgery of codimension at least three and we give lower and upper bounds in terms of the α-genus.

Tree simplification and the 'plateaux' phenomenon of graph Laplacian eigenvalues

We developed a procedure of reducing the number of vertices and edges of a given tree, which we call the " tree simplification procedure, " without changing its topological information. Our motivation for developing this procedure was to reduce computational costs of graph Laplacian eigenvalues of such trees. When we applied this procedure to a set of trees representing dendritic structures of ...

Laplacian eigenvalues and optimality: II. The Laplacian of a graph

Eigenvalues of the normalized Laplacian

A graph can be associated with a matrix in several ways. For instance, by associating the vertices of the graph to the rows/columns and then using 1 to indicate an edge and 0 otherwise we get the adjacency matrix A. The combinatorial Laplacian matrix is defined by L = D − A where D is a diagonal matrix with diagonal entries the degrees and A is again the adjacency matrix. Both of these matrices...

On Laplacian Eigenvalues of a Graph

Let G be a connected graph with n vertices and m edges. The Laplacian eigenvalues are denoted by μ1(G) ≥ μ2(G) ≥ ·· · ≥ μn−1(G) > μn(G) = 0. The Laplacian eigenvalues have important applications in theoretical chemistry. We present upper bounds for μ1(G)+ · · ·+μk(G) and lower bounds for μn−1(G)+ · · ·+μn−k(G) in terms of n and m, where 1 ≤ k ≤ n−2, and characterize the extremal cases. We also ...